Process Design for Efficient Scheduling
نویسندگان
چکیده
For manufacturing, management needs to make rapid, informed strategic decisions to react to changes in the market place. In many of these cases the decisions will give rise to a redesign of the manufacturing processes (layout, changes in product mix and volumes), which in turn changes the nature of the scheduling problems associated with the production facilities. However, the necessary skills and time in bridging the gap between design and scheduling are not available to allowmanagers to evaluate the many different high level decisions. In this paper, we propose an architecture which brings some scheduling capabilities to managers and planners. This approach is evaluated on two real-life design scenarios considered by a manufacturing company. Copyright c ©2006 IFAC
منابع مشابه
Efficient Algorithms for Just-In-Time Scheduling on a Batch Processing Machine
Just-in-time scheduling problem on a single batch processing machine is investigated in this research. Batch processing machines can process more than one job simultaneously and are widely used in semi-conductor industries. Due to the requirements of just-in-time strategy, minimization of total earliness and tardiness penalties is considered as the criterion. It is an acceptable criterion for b...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملA Flexible Job Shop Scheduling Problem with Controllable Processing Times to Optimize Total Cost of Delay and Processing
In this paper, the flexible job shop scheduling problem with machine flexibility and controllable process times is studied. The main idea is that the processing times of operations may be controlled by consumptions of additional resources. The purpose of this paper to find the best trade-off between processing cost and delay cost in order to minimize the total costs. The proposed model, flexibl...
متن کاملAn Energy-efficient Mathematical Model for the Resource-constrained Project Scheduling Problem: An Evolutionary Algorithm
In this paper, we propose an energy-efficient mathematical model for the resource-constrained project scheduling problem to optimize makespan and consumption of energy, simultaneously. In the proposed model, resources are speed-scaling machines. The problem is NP-hard in the strong sense. Therefore, a multi-objective fruit fly optimization algorithm (MOFOA) is developed. The MOFOA uses the VIKO...
متن کاملStability Proof of Gain-Scheduling Controller for Skid-to-Turn Missile Using Kharitonov Theorem
Gain scheduling is one of the most popular nonlinear control design approaches which has been widely and successfully applied in fields ranging from aerospace to process control. Despite the wide application of gain scheduling controllers, there is a notable lack of analysis on the stability of these controllers. The most common application of these kinds of controllers is in the field of fligh...
متن کامل